Eliminating partially dead code in explicitly parallel programs

Universitat Passau Fakult at F Ur Mathematik Und Informatik P Eliminating Partially Dead Code in Explicitly Parallel Programs 1

Eliminating partially dead code has proved to be a powerful technique for the runtime optimization of sequential programs. In this article, we show how this technique can be adapted to explicitly parallel programs with shared memory and interleaving semantics on the basis of a recently presented framework for e cient and precise bitvector analyses for this program setting. Whereas the framework...

Eliminating Dead Code on Re ursive Data ?

Eliminating Dead Code on Recursive Data

This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis as computing liveness patterns at all program points based on constraints constructed from t...

Array SSA for Explicitly Parallel Programs

The usefulness and applicability of the Static Single Assignment (SSA) framework is undisputed. SSA was originally crafted for sequential programs manipulating scalars, but it has been separately extended to parallel programs on the one hand, and to sequential programs with arrays on the other. In an Array SSA framework, arrays are precisely handled on an element-per-element basis. This paper p...

Platform-independent modeling of explicitly parallel programs

We propose a model-driven approach to parallel programming of SPMD-style, explicitly parallel computations. We define an executable, platform-independent modeling language with explicitly parallel control and data flow for an abstract parallel computer with shared address space, and implement it as an extension of UML2 activity diagrams and a generator for Fork source code that can be compiled ...